RefineNet: Multi-Path Refinement Networks for Dense Prediction
نویسندگان
چکیده
منابع مشابه
RefineNet: Multi-Path Refinement Networks with Identity Mappings for High-Resolution Semantic Segmentation
Recently, very deep convolutional neural networks (CNNs) have shown outstanding performance in object recognition and have also been the first choice for dense classification problems such as semantic segmentation. However, repeated subsampling operations like pooling or convolution striding in deep CNNs lead to a significant decrease in the initial image resolution. Here, we present RefineNet,...
متن کاملMulti-Scale Dense Convolutional Networks for Efficient Prediction
We introduce a new convolutional neural network architecture with the ability to adapt dynamically to computational resource limits at test time. Our network architecture uses progressively growing multi-scale convolutions and dense connectivity, which allows for the training of multiple classifiers at intermediate layers of the network. We evaluate our approach in two settings: (1) anytime cla...
متن کاملLocal heuristic for the refinement of multi-path routing in wireless mesh networks
We consider wireless mesh networks and the problem of routing end-toend traffic over multiple paths for the same origin-destination pair with minimal interference. We introduce a heuristic for path determination with two distinguishing characteristics. First, it works by refining an extant set of paths, determined previously by a singleor multi-path routing algorithm. Second, it is totally loca...
متن کاملRobust multi - path routing for sensor networks
Wireless sensor networks are being widely researched and are expected to be used in several scenarios. On the leading edge of treads, ondemand, high-reliability, and low-latency routing p r o ~ o l is desirable for i n d m environment applications. This article proposes a routing scheme called robust multi-path routing that establishes and uses multiple node-disjoint routes. Providing multiple ...
متن کاملALGORITHMS FOR BIOBJECTIVE SHORTEST PATH PROBLEMS IN FUZZY NETWORKS
We consider biobjective shortest path problems in networks with fuzzy arc lengths. Considering the available studies for single objective shortest path problems in fuzzy networks, using a distance function for comparison of fuzzy numbers, we propose three approaches for solving the biobjective prob- lems. The rst and second approaches are extensions of the labeling method to solve the sing...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Pattern Analysis and Machine Intelligence
سال: 2019
ISSN: 0162-8828,2160-9292,1939-3539
DOI: 10.1109/tpami.2019.2893630